Communication-Aware Scheduling of Data-Parallel Tasks on Multicore Architectures
نویسندگان
چکیده
منابع مشابه
Dynamic Scheduling of Real-Time Tasks on Multicore Architectures
We present a new dynamic scheduling on multicore architectures. This is an improvement of the Optimal Finish Time (OFT) scheduler introduced by Lemerre[7] reducing preemptions. Our result is compared with other schedulers and we show that our algorithm can handle with more general scheduling problems.
متن کاملDesign and Implementation of a Cache Hierarchy-aware Task Scheduling for Parallel Loops on Multicore Architectures
Effective cache utilization is critical to performance in chip-multiprocessor systems (CMP). Modern CMP architectures are based on hierarchical cache topology with varying private and shared caches configurations at different levels. Cache-aware scheduling has become a great design challenge. Many scheduling strategies have been designed to target specific cache configuration. In this paper we ...
متن کاملEnergy-Aware Scheduling for Parallel Applications on Multicore Systems
This chapter discusses energy-aware scheduling techniques for parallel applications on multicore computers. Key techniques for developing an energy-aware scheduler, such as estimation of power usage and performance features per application, are analyzed and evaluated. The authors first discuss the runtime profiling techniques for collecting detailed application-specific information to be used b...
متن کاملScaling FMM with Data-Driven OpenMP Tasks on Multicore Architectures
Poor scalability on parallel architectures can be attributed to several factors, among which idle times, data movement, and runtime overhead are predominant. Conventional parallel loops and nested parallelism have proved successful for regular computational patterns. For more complex and irregular cases, however, these methods often perform poorly because they consider only a subset of these co...
متن کاملParallel MLEM on Multicore Architectures
The efficient use of multicore architectures for sparse matrixvector multiplication (SpMV) is currently an open challenge. One algorithm which makes use of SpMV is the maximum likelihood expectation maximization (MLEM) algorithm. When using MLEM for positron emission tomography (PET) image reconstruction, one requires a particularly large matrix. We present a new storage scheme for this type of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IPSJ Transactions on System LSI Design Methodology
سال: 2019
ISSN: 1882-6687
DOI: 10.2197/ipsjtsldm.12.65